There are Infinitely Many Perrin Pseudoprimes
نویسنده
چکیده
This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the proof of the infinitude of Carmichael numbers, along with zero-density estimates for Hecke L-functions.
منابع مشابه
Cipolla Pseudoprimes
We consider the pseudoprimes that M. Cipolla constructed. We call such pseudoprimes Cipolla pseudoprimes. In this paper we find infinitely many Lucas and Lehmer pseudoprimes that are analogous to Cipolla pseudoprimes.
متن کاملFrobenius pseudoprimes
The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word “pseudoprime” in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas pseudoprimes, extra strong Lucas pseudoprimes and Perrin pseudoprimes. Though these tests represent a wealth of ideas, they exist as a hodge-podge of definiti...
متن کاملOn the Number of Elliptic Pseudoprimes
For an elliptic curve E with complex multiplication by an order in K = Q('A-Ai), a point P of infinite order on E, and any prime p with (-d \ p) = —1, we have that (p + 1) • P = O(modp), where O is the point at infinity and calculations are done using the addition law for E. Any composite number which satisfies these conditions is called an elliptic pseudoprime. In this paper it is shown that, ...
متن کاملNonexistence of Even Fibonacci Pseudoprimes of The
With regard to this problem, Di Porto and Filipponi, in [4], conjectured that there are no even-Fibonacci pseudoprimes of the 1 kind, providing some constraints are placed on their existence, and Somer, in [12], extends these constraints by stating some very interesting theorems. Moreover, in [1], a solution has been found for a similar problem, that is, for the sequence {Vn(2,1)}, defined by F...
متن کاملOn a Conjecture of Di Porto and Filipponi
As is well known, properties (1) and (2) are satisfied if n is prime. More interestingly, there are infinitely many composite numbers n which satisfy (1) and/or (2). We call these n "Fibonacci pseudoprimes" (or FPP's) if they satisfy (1), and "Lucas pseudoprimes" (or LPP's) if they satisfy (2). As has been remarked elsewhere [1], this nomenclature is not standard, but should be acceptable to mo...
متن کامل